An Adaptive Real Time Task Scheduler
نویسندگان
چکیده
Time constraint is the main factor in real time operating system. Different scheduling algorithm is used to schedule the task. The Earliest Deadline First and Ant Colony Optimization is a dynamic scheduling algorithm used in a real time system and it is most beneficial scheduling algorithm for single processor real-time operating systems when the systems are preemptive and under loaded. The main problem in EDF algorithm is that the performance of the system decreases because of overload condition. To solve this problem ACO (Ant Colony Optimization) based scheduling algorithm for real-time operating system is used which assures the overloaded condition. But the ACO algorithm takes more time for completing the task. The performance of the EDF and ACO is calculated in terms of Success Ratio and Effective CPU Utilization. The goal is to switch automatically between EDF algorithm and ACO based scheduling algorithm to deal overloaded and under loaded conditions.
منابع مشابه
Dynamic Hw Priority Queue Based Schedulers for Embedded System
A real-time operating system (RTOs) is often used in embedded system, to structure the application code and to ensure that the deadlines are met by reacting on events by executing the functions within precise time. Most embedded systems are bound to real-time constraints with determinism and latency as a critical metrics. RTOs are generally implemented in software, increases computational overh...
متن کاملImplementing adaptive time-triggered co-operative scheduling framework for highly-predictable embedded systems
For many real-time embedded systems, Time-Triggered Co-operative (TTC) scheduling algorithms provide simple and reliable solution at low cost. Previous work in this area has focused on the development of a wide range of TTC implementations for various purposes (e.g. for achieving low-jitter characteristics, reducing CPU power consumption or dealing with task-overruns). Despite the great deal of...
متن کاملAdaptive Neuro Fuzzy Scheduler for Real Time Task: A Review
In a real time system contained various type of scheduling algorithms. They are used for determine which processes should be executed by the CPU when there are different processes to be executed. Neuro fuzzy logic approaches are very effective for scheduling real time task. This paper presents a review on scheduling algorithm of real time task. Then, discuss the limitations of EDF algorithm and...
متن کاملAnalysis of a Reservation-Based Feedback Scheduler
When executing soft real-time tasks in a shared processor, it is important to properly allocate the computational resources such that the quality of service requirements of each task are satisfied. In this paper we propose Adaptive Reservations, based on applying a feedback scheme to a reservation based scheduler. After providing a precise mathematical model of the scheduler, we describe how th...
متن کاملAdaptive Task Automata with Earliest-Deadline-First Scheduling
Adjusting to resource changes, dynamic environmental conditions, or new usage modes are some of the reasons why real-time embedded systems need to be adaptive. This requires a rigorous framework for designing such systems, to ensure that the adaptivity does not result in invalidating the system’s real-time constraints. To address this need, we have recently introduced adaptive task automata, a ...
متن کامل